A distributed approach for shortest path algorithm in dynamic multimodal transportation networks
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملDesign and Implementation Issues of a Time-dependent Shortest Path Algorithm for Multimodal Transportation Network
In recent years the structure of transportation networks has become more complex as a result of the fast development of the social and economical infrastructure. When dealing with time dependent multimodal context, transport planning represents a fundamental problem and more specifically for hazardous materials. Several approaches have been proposed that strive to reduce the financial costs, tr...
متن کاملEngineering shortest-path algorithms for dynamic networks
The problem of updating shortest paths in networks whose topology dynamically changes over time is a core functionality of many nowadays networked systems. In fact, the problem finds application in many real-world scenarios such as Internet routing and route planning in road networks. In these scenarios, shortest-path data are stored in different ways and have to be updated whenever the underly...
متن کاملA Distributed Shortest Path Algorithm for a Planar Network
An algorithm is presemed for finding a single source shortest path tree in a planar undirected distributed network with nonnegative edge COSlS. The number of messages used by the algorithm is 0 (n 513) on an n-node network.' Distributed algorithms are also presemed for finding a breadth-first spanning tree in a general network, for finding a shortest path tree in a general network, for finding ...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2017
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2017.12.094